Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

B(y, b(a, z)) → B(f(z), a)
F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
B(y, b(a, z)) → F(c(y, y, a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)

The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

B(y, b(a, z)) → B(f(z), a)
F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
B(y, b(a, z)) → F(c(y, y, a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)

The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)

The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


F(f(f(c(z, x, a)))) → F(x)
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)
The remaining pairs can at least be oriented weakly.

B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
Used ordering: Polynomial interpretation [25,35]:

POL(f(x1)) = (4)x_1   
POL(a) = 0   
POL(b(x1, x2)) = 3/4 + x_2   
POL(c(x1, x2, x3)) = 4 + (5/4)x_1 + (2)x_2 + (1/4)x_3   
POL(B(x1, x2)) = 4 + (1/4)x_2   
POL(F(x1)) = 13/4 + (1/4)x_1   
The value of delta used in the strict ordering is 15/16.
The following usable rules [17] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))

The TRS R consists of the following rules:

f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.